Spatial Query Optimization: From Boolean Constraints to Range Queries
نویسندگان
چکیده
منابع مشابه
Multiple Range Query Optimization in Spatial Databases
Abstract. In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for processing. Initially, we consider grouping of pairs of requests only, and give two algorithms with exponential and linear complexity. Then, we generalize the linear method, grouping more than two requests per grou...
متن کاملUB-Tree Indexing for Semantic Query Optimization of Range Queries
Semantic query optimization consists in restricting the search space in order to reduce the set of objects of interest for a query. This paper presents an indexing method based on UB-trees and a static analysis of the constraints associated to the views of the database and to any constraint expressed on attributes. The result of the static analysis is a partitioning of the object space into dis...
متن کاملQuery Optimization by Stored Queries
A stored query is a pair , where "respons&' is the-query meaning for the current database state. When a collection of stored queries is available responses to sane queries may be obtained easily. Stored queries give a possibility of improvement of database sys tern response time regardless of the complexity of user request and the data model assumed. The method is a generalizati...
متن کاملSpatial Query Optimization Based on Transformation of Constraints
This article describes a problem of spatial query optimization. The processing of such queries is a new area of rapidly developing domain of spatial databases. The main scope of considerations is the impact of constraints type on the speed of execution. Transformation of logical formulas is proposed for some kind of queries as a method of optimization. Proposed decompositions of queries were do...
متن کاملMultiple Range Query Optimization
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for processing. Initially, we consider grouping of pairs of requests only, and give two algorithms with exponential and linear complexity. Then, we generalize the linear method, grouping more than two requests per group. We eval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1061